Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, x), z))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), y)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), y)), z)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, x), y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, app2(app2(:, x), y)), z))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, x), z))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), y)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), y)), z)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, x), y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, app2(app2(:, app2(app2(:, x), y)), z))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(:, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 14 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), y)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, x), y)), z)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, x), z)
APP2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> APP2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
The remaining pairs can at least be oriented weakly.

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( filter ) = 2


POL( true ) = 0


POL( false ) = max{0, -3}


POL( map ) = 3


POL( app2(x1, x2) ) = x1 + 2x2 + 1


POL( filter2 ) = 2


POL( APP2(x1, x2) ) = 2x2 + 2


POL( cons ) = max{0, -1}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)

The TRS R consists of the following rules:

app2(app2(:, app2(app2(:, app2(app2(:, app2(app2(:, C), x)), y)), z)), u) -> app2(app2(:, app2(app2(:, x), z)), app2(app2(:, app2(app2(:, app2(app2(:, x), y)), z)), u))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.